MATHEMATICAL ENGINEERING TECHNICAL REPORTS Hybrid Metaheuristics for Packing Problems
نویسندگان
چکیده
The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
منابع مشابه
Industrial Engineering and Computer Sciences Division (G2I) EVOLUTIONARY, CONSTRUCTIVE and HYBRID PROCEDURES FOR THE BIOBJECTIVE SET PACKING PROBLEM
The bi-objective set packing problem is a multi-objective combinatorial optimization problem similar to the well-known set covering/partitioning problems. To our knowledge, this problem has surprisingly not yet been studied. In order to resolve a practical problems encountered in railway infrastructure capacity planning, procedures for computing a solution to this bi-objective combinatorial pro...
متن کاملModeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Practical Algorithms for Two-dimensional Packing
متن کامل
Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملDecomposition based hybrid metaheuristics
Difficult combinatorial optimization problems coming from practice are nowadays often approached by hybrid metaheuristics that combine principles of classical metaheuristic techniques with advanced methods from fields like mathematical programming, dynamic programming, and constraint programming. If designed appropriately, such hybrids frequently outperform simpler “pure” approaches as they are...
متن کامل